Embedding a family of 2D meshes into Möbius cubes
نویسندگان
چکیده
Abstract: Möbius cubes are an important class of hypercube variants. This paper addresses how to embed a family of disjoint 2D meshes into a Möbius cube. Two major contributions of this paper are: (1) For n ≥ 1, there exists a 2 × 2 mesh that can be embedded in the n-dimensional Möbius cube with dilation 1 and expansion 1. (2) For n ≥ 4, there are two disjoint 4 × 2 meshes that can be embedded in the n-dimensional 0-type Möbius cube with dilation 1. The results are optimal in the sense that the dilations of the embeddings are 1. The result (2) mean that a family of two 2D-mesh-structured parallel algorithms can be operated on a same crossed cube efficiently and in parallel.
منابع مشابه
Guaranteed Nonobtuse Meshes via Constrainted Optimizations
The problem of nonobtuse triangulation has been studied in the 2D domains, however, guaranteed nonobtuse remeshing of curve surfaces is still an open problem. Nonobtuse meshes are desirable in certain situations such as geodesic computations and planar mesh embedding. In this paper, we propose a solution to nonobtuse remeshing and nonobtuse decimation. Our approach utilizes a “deform-to-fit" st...
متن کاملEfficient Embeddings into Hypercube-like Topologies
Embeddings of various graph classes into hypercubes have been widely studied. Almost all these classes are regularly structured graphs such as meshes, complete trees or pyramids. In this paper, we present a general method for one-to-one embeddings of irregularly structured graphs into their optimal hypercubes, based on extended edge bisectors of graphs. An extended edge bisector is an edge bise...
متن کاملOptimal geodesic cycles embedding of Möbius cubes
For two vertices X,Y ∈ V (G), a cycle is called a geodesic cycle with X and Y if a shortest path joining X and Y lies on the cycle. A graph G is called to be geodesic k-pancyclic if any two vertices X,Y on G have such geodesic cycle of length l that 2dG(X,Y ) + k ≤ l ≤ |V (G)|. In this paper, we show that the n-dimensional Möbius cube MQn is geodesic 2-pancyclic for n ≥ 3. This result is optima...
متن کاملCyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees
We introduce a new family of interconnection networks that are Cayley graphs with xed degrees of any even number greater than or equal to 4. We call the proposed graphs cyclic-cubes because contracting some cycles in such a graph results in a generalized hypercube. These Cayley graphs have optimal fault tolerance and logarithmic diameters. For comparable number of nodes, a cyclic-cube can have ...
متن کاملEmbeddings of Linear Arrays, Rings and 2-D Meshes on Extended Lucas Cube Networks
A Fibonacci string is a length n binary string containing no two consecutive 1s. Fibonacci cubes (FC), Extended Fibonacci cubes (ELC) and Lucas cubes (LC) are subgraphs of hypercube defined in terms of Fibonacci strings. All these cubes were introduced in the last ten years as models for interconnection networks and shown that their network topology posseses many interesting properties that are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008